Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete
نویسندگان
چکیده
منابع مشابه
Interactive Proofs For Quantum Computations
Making the computation of U|x〉 blind: we use a universal circuit Q, which on input |“U”〉 |x〉 outputs |“U”〉 U|x〉 Fault tolerance: we adapt standard techniques to the QPIP protocol. Care is due since the verifier needs to prepare authenticated states sequentially, due to lack of space. Interactive View of Shor’s Algorithm For N=xy,x≤y decide whether xi=1 P sends x,y: x≤y & xy=N. V accepts if xy=N...
متن کاملInteractive Proofs For Quantum Computation
The widely held belief that BQP strictly contains BPP raises fundamental questions: Upcoming generations of quantum computers might already be too large to be simulated classically. Is it possible to experimentally test that these systems perform as they should, if we cannot efficiently compute predictions for their behavior? Vazirani has asked [Vaz07]: If computing predictions for Quantum Mech...
متن کاملQuantum Interactive Proofs with Competing Provers
This paper studies quantum refereed games, which are quantum interactive proof systems with two competing provers: one that tries to convince the verifier to accept and the other that tries to convince the verifier to reject. We prove that every language having an ordinary quantum interactive proof system also has a quantum refereed game in which the verifier exchanges just one round of message...
متن کاملQuantum interactive proofs with short messages
This paper considers three variants of quantum interactive proof systems in which short (meaning logarithmic-length) messages are exchanged between the prover and verifier. The first variant is one in which the verifier sends a short message to the prover, and the prover responds with an ordinary, or polynomial-length, message; the second variant is one in which any number of messages can be ex...
متن کاملInteractive proofs with quantum finite automata
Following an early work of Dwork and Stockmeyer on interactive proof systems whose verifiers are two-way probabilistic finite automata, the authors studied in 2004 the computational power of quantum interactive proof systems whose verifiers are particularly limited to quantum finite automata. As a follow-up to this early study, we further investigate the quantum nature of interactions between p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2015
ISSN: 0097-5397,1095-7111
DOI: 10.1137/140971944